Squaring the Square with Integer Linear Programming
نویسندگان
چکیده
منابع مشابه
Squaring the Square with Integer Linear Programming
We consider so-called “squaring the square”-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite involved. As an alternative to exhaustive enumeration using tailored algorithms we describe the general approach of formulating the problem as an integer line...
متن کاملLinear Programming and Integer Linear Programming
5 Algorithms 8 5.1 Fourier-Motzkin Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 The Simplex Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Seidel’s Randomized Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 The Ellipsoid Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.5 Using the Ellipsoid...
متن کاملInteractive Gender Inference with Integer Linear Programming
Interactive gender inference aims to infer the genders of the two involved users in a communication from the interactive text. In this paper, we address this task by proposing a joint inference approach which well incorporates label correlations among the instances. Specifically, an Integer Linear Programming (ILP) approach is proposed to achieve global optimization with various kinds of intra-...
متن کاملGrammatical Role Labeling with Integer Linear Programming
In this paper, we present a formalization of grammatical role labeling within the framework of Integer Linear Programming (ILP). We focus on the integration of subcategorization information into the decision making process. We present a first empirical evaluation that achieves competitive precision and recall rates.
متن کاملAn integer linear programming approach for bilinear integer programming
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2012
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.20.680